package leetcode.code1687;

// 啊 真难
public class Solution {
	public int boxDelivering(int[][] boxes, int portsCount, int maxBoxes, int maxWeight) {
		int sumWeight = 0, sumBox = 0;
		int l = 0, r = 0;
		int len = boxes.length;
		
		while (sumBox <= maxBoxes && sumWeight <= maxWeight) {

		}
		return len;
	}
}
